Graphs with large maximum degree containing no odd cycles of a given length
نویسندگان
چکیده
Let us write f(n, ∆; C2k+1) for the maximal number of edges in a graph of order n and maximum degree ∆ that contains no cycles of length 2k + 1. For n 2 ≤ ∆ ≤ n − k − 1 and n sufficiently large we show that f(n, ∆; C2k+1) = ∆(n −∆), with the unique extremal graph a complete
منابع مشابه
Eliminating Odd Cycles by Removing a Matching
We study the problem of determining whether a given graph G = (V,E) admits a matching M whose removal destroys all odd cycles of G (or equivalently whether G−M is bipartite). This problem is also equivalent to determine whether G admits a (1,1)-coloring, which is a 2-coloring of V (G) in which each color class induces a graph of maximum degree at most 1. We show that such a decision problem is ...
متن کاملMinimally Non-Preperfect Graphs of Small Maximum Degree
A graph G is called preperfect if each induced subgraph G 0 G of order at least 2 has two vertices x; y such that either all maximum cliques of G 0 containing x contain y, or all maximum independent sets of G 0 containing y contain x, too. Giving a partial answer to a problem of Hammer and Maaray Combinatorica 13 (1993), 199{208], we describe new classes of minimally non-preperfect graphs, and ...
متن کاملA cycle decomposition conjecture for Eulerian graphs
A classic theorem of Veblen states that a connected graph G has a cycle decomposition if and only if G is Eulerian. The number of odd cycles in a cycle decomposition of an Eulerian graph G is therefore even if and only if G has even size. It is conjectured that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph G with m edges is a and the maximum number of odd cyc...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملStructure and algorithms for (cap, even hole)-free graphs
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with the cycle. In this paper, we consider (cap, even hole)-free graphs, and more generally, (cap, 4-hole)-free odd-signable graphs. We give an explicit construction of these graphs. We prove that every such graph G has a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 87 شماره
صفحات -
تاریخ انتشار 2003